Generalized Classes of Weak Keys on RC4 Using Predictive State
نویسندگان
چکیده
منابع مشابه
Generalized Classes of Weak Keys on RC4 Using Predictive State
Conventional class of weak keys on RC4 stream cipher is defined as a specific case that combinations of the first three bytes of secret key satisfy two relational equations. This paper expands and generalizes the classes of weak keys using generalized relational equations and special classes of the internal state (called predictive state). We derive the probability that generalized classes of w...
متن کاملOn Generalized Weak Structures
Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α(g),π(g),σ(g) and β(g). This work is a further investigation of generalized weak structures due to Avila and Molina. Further we introduce the structures ro(g) and rc(g) and study the properties of the structures r...
متن کاملThe Perils of Repeating Patterns: Observation of Some Weak Keys in RC4
We describe some observed trivially weak keys for the stream cipher RC4. Keys with repeating patterns are found to be key length invariant. The cause of the problem is the simplistic key dependent state permutation in the RC4 initialization. Introduction While writing the draft for RFC 6229 [1] and testing suitable test vectors, we observed that for some keys with different lengths, the stream ...
متن کاملOn Reconstruction of RC4 Keys from Internal States
In this work key recovery algorithms from the known internal states of RC4 are investigated. In particular, we propose a bit-by-bit approach to recover the key by starting from LSB’s of the key bytes and ending with their MSB’s.
متن کاملEfficient Reconstruction of RC4 Keys from Internal States
In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster than previously published algorithms. In the case of a 40-bit key, it takes only about 0.02 seconds to retrieve the key, with success probability of 86.4%. Even if the algorithm cannot retrieve the entire key, it can retrieve part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2011
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e94.a.10